Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup

This paper approaches the integrated lot sizing and scheduling problem (ILSSP), in which non-identical machines work parallel with non-triangular sequence-dependent setup costs times, carry-over capacity limitation. The aim of studied ILSSP, here called ILSSP-NT on machines, is to determine a production planning tasks sequencing that meet period demands without delay such way total production, machine inventory are minimized. dearth literature ILSSP-NT, despite increasing amount applications industrial sector, mainly food processing industry, motivated us conduct this study. In paper, we propose efficient methods solve machines. virtually consist hybridization relax-and-fix fix-and-optimize path-relinking kernel search heuristics. To assess how well heuristics compared their results those CPLEX solver fixed CPU time limit. proposed matheuristics significantly outperformed most tested instances.